Transversal intersection formula for compacta
نویسندگان
چکیده
منابع مشابه
A general intersection formula for Lagrangian cycles
We prove a generalization to the context of real geometry of an intersection formula for the vanishing cycle functor, which in the complex context is due to Dubson, Lê, Ginsburg and Sabbah (after a conjecture of Deligne). It is also a generalization of similar results of Kashiwara-Schapira, where these authors work with a suitable assumption about the micro-support of the corresponding construc...
متن کاملAn arithmetic intersection formula for denominators of Igusa class polynomials
In this paper we prove an explicit formula for the arithmetic intersection number (CM(K).G1)` on the Siegel moduli space of abelian surfaces, generalizing the work of Bruinier-Yang and Yang. These intersection numbers allow one to compute the denominators of Igusa class polynomials, which has important applications to the construction of genus 2 curves for use in cryptography. Bruinier and Yang...
متن کاملAn Effective Recursion Formula for Computing Intersection Numbers
Mg,n ψ1 1 · · ·ψ dn n . Witten-Kontsevich theorem [9, 4] provides a recursive way to compute all these intersection numbers. However explicit and effective recursion formulae for computing intersection indices are still very rare and very welcome. Our n-point function formula [5] computes intersection indices recursively by decreasing the number of marked points. So it is natural to ask whether...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1998
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(97)00142-9